Metaheuristics for a Multi-Compartment Vehicle Routing Problem in Glass Waste Collection
نویسندگان
چکیده
منابع مشابه
An ant colony algorithm for the multi-compartment vehicle routing problem
We demonstrate the use of Ant Colony System (ACS) to solve the capacitated vehicle routing problem associated with collection of recycling waste from households, treated as nodes in a spatial network. For networks where the nodes are concentrated in separate clusters, the use of k-means clustering can greatly improve the efficiency of the solution. The ACS algorithm is extended to model the use...
متن کاملThe multi-compartment vehicle routing problem with flexible compartment sizes
In this paper, a capacitated vehicle routing problem is discussed which occurs in the context of glass waste collection. Supplies of several different product types (glass of different colors) are available at customer locations. The supplies have to be picked up at their locations and moved to a central depot at minimum cost. Different product types may be transported on the same vehicle, howe...
متن کاملWaste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan
Collection of waste is an important logistic activity within any city. In this study, a mathematical model is proposed in order to reduce the cost of waste collection. First a mixed-integer nonlinear programming model is provided including a waste collection routing problem, so that, there is a balance between the distance between trashcans, and the similarity of the trashcans in terms of th...
متن کاملRouting Vehicle of Urban Waste Collection Utilities GIS
Municipal solid waste collection is expensive and, in some cities, 46–85% of their whole waste management expenses are used for waste collection and transportation. Rapid urbanization and every day human actions generate a large amount of waste from residential, commercial, or industrial extents all over the world. Waste collection optimization can decrease the waste collection budget and envir...
متن کاملA hybrid metaheuristic algorithm for solving a rollon–rolloff waste collection vehicle routing problem considering waste separation and recycling center
This paper addresses a rollon–rolloff waste collection vehicle routing problem which involves large containers that collect huge amounts of waste from construction sites and shopping malls. In this problem, vehicles could only move one container at a time between customers’ locations, a depot, a disposal center, and a recycling center site. Other than a disposal center, a recycling ...
متن کامل